Vertex partitions of (C3, C4, C6)-free planar graphs
نویسندگان
چکیده
A graph is (k1, k2)-colorable if its vertex set can be partitioned into a graph with maximum degree at most k1 and and a graph with maximum degree at most k2. We show that every (C3, C4, C6)-free planar graph is (0, 6)-colorable. We also show that deciding whether a (C3, C4, C6)-free planar graph is (0, 3)-colorable is NP-complete.
منابع مشابه
k-Efficient partitions of graphs
A set $S = {u_1,u_2, ldots, u_t}$ of vertices of $G$ is an efficientdominating set if every vertex of $G$ is dominated exactly once by thevertices of $S$. Letting $U_i$ denote the set of vertices dominated by $u_i$%, we note that ${U_1, U_2, ldots U_t}$ is a partition of the vertex setof $G$ and that each $U_i$ contains the vertex $u_i$ and all the vertices atdistance~1 from it in $G$. In this ...
متن کاملThe Price of Connectivity for Vertex Cover: Perfect, Near-Perfect and Critical Graphs
In this paper we investigate the ratio of the connected vertex cover number to the vertex cover number in graphs, called the Price of Connectivity (PoC). For general graphs, this ratio is strictly bounded by 2. We prove that for every (P5, C5, C4)-free graph the ratio equals 1. We prove also that for every (P5, C4)-free graph the ratio is bounded by 4/3 and that for every (P7, C6,∆1,∆2)-free gr...
متن کاملComments for radiological study of C3–C4 level surgical cases of cervical spondylosis
OBJECTIVE The purpose of this study was to elucidate the pathological characteristics of C3-C4 cervical spondylotic myelopathy (CSM) from the radiological study. MATERIALS AND METHODS A total of 31 patients with single level anterior cervical discectomy and fusion (ACDF) at C3-C4 and 46 patients with single level ACDF at C5-C6 were included in this study. We selected C5-C6 level as a represen...
متن کاملThe Occupancy of the Components in the Cervical Spine and Their Changes with Extension and Flexion
Study Design Retrospective case series. Objectives The kinematics of the cervical spine has been investigated by many researchers. However, the occupancy of the disk bulges, spinal cord, ligamentum flavum, and the rest of the canal as well as the changes of these structures with motion have not yet been investigated. The goal of this study is to investigate these dynamic changes. Methods The ki...
متن کاملPartitioning into Two Graphs with Only Small Components
The paper presents several results on edge partitions and vertex partitions of graphs into graphs with bounded size components. We show that every graph of bounded tree-width and bounded maximum degree admits such partitions. We also show that an arbitrary graph of maximum degree three has a vertex partition into two graphs, each of which has components on at most two vertices, and an edge part...
متن کاملذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
برای دانلود متن کامل این مقاله و بیش از 32 میلیون مقاله دیگر ابتدا ثبت نام کنید
ثبت ناماگر عضو سایت هستید لطفا وارد حساب کاربری خود شوید
ورودعنوان ژورنال:
- CoRR
دوره abs/1711.08710 شماره
صفحات -
تاریخ انتشار 2017